Research Article Generalized Augmented Lagrangian Problem and Approximate Optimal Solutions in Nonlinear Programming
نویسندگان
چکیده
We introduce some approximate optimal solutions and a generalized augmented Lagrangian in nonlinear programming, establish dual function and dual problem based on the generalized augmented Lagrangian, obtain approximate KKT necessary optimality condition of the generalized augmented Lagrangian dual problem, prove that the approximate stationary points of generalized augmented Lagrangian problem converge to that of the original problem. Our results improve and generalize some known results.
منابع مشابه
Solving Environmental/Economic Power Dispatch Problem by a Trust Region Based Augmented Lagrangian Method
This paper proposes a Trust-Region Based Augmented Method (TRALM) to solve a combined Environmental and Economic Power Dispatch (EEPD) problem. The EEPD problem is a multi-objective problem with competing and non-commensurable objectives. The TRALM produces a set of non-dominated Pareto optimal solutions for the problem. Fuzzy set theory is employed to extract a compromise non-dominated sol...
متن کاملAugmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems
One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...
متن کاملOn a Hyperbolic Augmented Lagrangian Artificial Fish Swarm Based Method: Convergence Issues
where f : Rn → R and g : Rn → Rp are nonlinear continuous functions and Ω = {x ∈ Rn : −∞ < l ≤ x ≤ u < ∞}. Problems with equality constraints, h(x) = 0, can be reformulated into the above form by converting into a couple of inequality constraints h(x)− β ≤ 0 and −h(x)− β ≤ 0, where β is a small positive relaxation parameter. Since we do not assume that the objective function f is convex, the pr...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA Nonlinear Lagrangian Approach to Constrained Optimization Problems
In this paper we study nonlinear Lagrangian functions for constrained optimization problems which are, in general, nonlinear with respect to the objective function. We establish an equivalence between two types of zero duality gap properties, which are described using augmented Lagrangian dual functions and nonlinear Lagrangian dual functions, respectively. Furthermore, we show the existence of...
متن کامل